A generalization of extension complexity that captures P
نویسندگان
چکیده
منابع مشابه
A generalization of extension complexity that captures $P$
In this paper we propose a generalization of the extension complexity of a polyhedron Q. On the one hand it is general enough so that all problems in P can be formulated as linear programs with polynomial size extension complexity. On the other hand it still allows non-polynomial lower bounds to be proved for NP -hard problems independently of whether or not P = NP . The generalization, called ...
متن کاملa generalization of strong causality
در این رساله t_n - علیت قوی تعریف می شود. این رده ها در جدول علیت فضا- زمان بین علیت پایدار و علیت قوی قرار دارند. یک قضیه برای رده بندی آنها ثابت می شود و t_n- علیت قوی با رده های علی کارتر مقایسه می شود. همچنین ثابت می شود که علیت فشرده پایدار از t_n - علیت قوی نتیجه می شود. بعلاوه به بررسی رابطه نظریه دامنه ها با نسبیت عام می پردازیم و ثابت می کنیم که نوع خاصی از فضا- زمان های علی پایدار, ب...
an extension and a generalization of dedekind's theorem
for any given finite abelian group, we give factorizations of the group determinant in the group algebra of any subgroups. the factorizations is an extension of dedekind's theorem. the extension leads to a generalization of dedekind's theorem.
متن کاملA generalization of Moulin's Pareto extension theorem
In this note, it is shown that for any strongly complete and quasitransitive binary relation B on a set X, there exists a set of linear orders on X such that B is simultaneously the union of these linear orders and the Pareto extension relation generated by them. No assumptions about the cardinality ́ of X are made. This result generalizes a theorem established by Herve Moulin for finite X. 20...
متن کاملA Generalization of p-Rings
Let R be a ring with Jacobson ideal J and center C. McCoy and Montgomery introduced the concept of a p-ring (p prime) as a ring R of characteristic p such that xp = x for all x in R. Thus, Boolean rings are simply 2-rings (p = 2). It readily follows that a p-ring (p prime) is simply a ring R of prime characteristic p such that R ⊆ N + Ep, where N = {0} and Ep = {x ∈ R : xp = x}. With this as mo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2015
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2015.02.005